Pushdown Stores and Subscripts
نویسنده
چکیده
V a ~ r i o u s d e v i c e s f o r t h e imp r o v e m e n t o f p h r a s e s t r u c t u r e g r a m m a r s (PSG) h a v e b e e n s u g g e s t e d r e c e n t l y . I n p a r t i c u l a r , t h e PSG m o d e l w i t h a p u s h d o w n s t o r e ( P S G / P D S ) a s d e s c r i b e d b y V o Y n g v e , a n d t h e PSG w i t h s u b s c r i p t s ( P S G / S ) a s d e s c r i b e d b y G o H a r m a n a r e c o n s i d e r e d . It is contended that such devices, even if they may do away with some of the difficul_ ties of PSG, do not contain sufficient gene_ rative power to produce the structurally corn_ plicated sentences that are generated by other gramma rs (e.g., of transformational type). The handling of multiple disco,Ltinuous con_ stituents (DC) in PSG/PDS, as well as the use of :leletion rules in PSC./S is examined and criticized. It is shown that the improvements on PSG will not allow the grammar to generate a ii the sentences of the language that a trans_ formational grammar (TG) does; moreovdr, the improvements on PSG a re obtained only at the cost of introducing too much power at the PS level, so that the improved gr;~mmars in some cases will exceed the requirem@nts of the de_ scription, i.e. generate non_grammatical sent_
منابع مشابه
Language Without A Central Pushdown Stack
We will attempt to show how human performance limitations on various types of syntactic embedding constructions in Germanic languages can be modelled in a relational network linguistic framework. After arguing against centralized data stores such as pushdown stacks and queues, we will demonstrate how interconnections among levels of linguistic structure can account for many of the psycholinguis...
متن کاملConcrete Semantics for Pushdown Analysis: The Essence of Summarization
Pushdown analysis is better than finite-state analysis in precision and performance. Why then have we not seen total widespread adoption of these techniques? For one, the known techniques are technically burdened and difficult to understand or extend. Control structure of the programming language gets pulled into the model of computation, which makes extensions to non-pushdown control structure...
متن کاملOn Finding the Strong Components in a Directed Graph
We present two improved versions of Tarjan's algorithm for nding the strongly connected (or strong, for short) components in a directed graph. The original algorithm of Tarjan can be considered to contain two (interleaved) traversals of the graph. First, a depth-rst search traverses all edges of the graph and constructs a depth-rst spanning forest. Second, once a root of a strong component is f...
متن کاملSome Remarks on Lower Bounds for Queues Machines (Preliminary Report)
We first give an improved lower bound for the deterministic onlinesimulation of tapes or pushdown stores by queues. Then we inspect some proofs in a classical work on queue machines in the area of Formal Languages and outline why a main argument in the proofs is incomplete.
متن کاملVisibly Pushdown Games
The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown systems where the winning condition is given by a visibly pushdown language. We establish that, unlike pushdown games with pushdown winning conditio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1965